Approximation algorithms for multi-parameter graph optimization problems
نویسندگان
چکیده
منابع مشابه
Approximation Algorithms for Some Graph Partitioning Problems
This paper considers problems of the following type: given an edgeweighted k-colored input graph with maximum color class size c, find a minimum or maximum c-way cut such that each color class is totally partitioned. Equivalently, given a weighted complete k-partite graph, cover its vertices with a minimum number of disjoint cliques in such a way that the total weight of the cliques is maximize...
متن کاملApproximation Algorithms for Graph Homomorphism Problems
We introduce the maximum graph homomorphism (MGH) problem: given a graph G, and a target graph H, find a mapping φ : VG 7→ VH that maximizes the number of edges of G that are mapped to edges of H. This problem encodes various fundamental NP-hard problems including Maxcut and Max-k-cut. We also consider the multiway uncut problem. We are given a graphG and a set of terminals T ⊆ VG. We want to p...
متن کاملEvolutionary Algorithms for Constrained Parameter Optimization Problems
Evolutionary computation techniques have received a lot of attention regarding their potential as optimization techniques for complex numerical functions. However, they have not produced a signi cant breakthrough in the area of nonlinear programming due to the fact that they have not addressed the issue of constraints in a systematic way. Only recently several methods have been proposed for han...
متن کاملApproximation algorithms for NP-hard optimization problems
In this chapter, we discuss approximation algorithms for optimization problems. An optimization problem consists in finding the best (cheapest, heaviest, etc.) element in a large set P, called the feasible region and usually specified implicitly, where the quality of elements of the set are evaluated using a function f(x), the objective function, usually something fairly simple. The element tha...
متن کاملApproximation Algorithms for Geometric Optimization Problems
This thesis deals with a number of geometric optimization problems which are all NP-hard. The first problem we consider is the set cover problem for polytopes in R3. Here, we are given a set of points in R3 and a fixed set of translates of an arbitrary polytope. We would like to select a subset of the given polytopes such that each input point is covered by at least one polytope and the number ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2002
ISSN: 0166-218X
DOI: 10.1016/s0166-218x(01)00269-4